منابع مشابه
Comparison of Due-date Oriented Dispatch Rules in Semiconductor Manufacturing
In this study we compare the cycle-time and on-time-delivery performance of the Critical Ratio (CR), the Earliest Due Date (EDD), and the Operation Due Date (ODD) dispatching rules in semiconductor wafer manufacturing. In addition, we comment on the robustness of the rules to low target flow factor values. It turns out that EDD has almost no positive effect on on-time delivery compared to First...
متن کاملComparison Analysis of Due Date Assignment Methods Using Scheduling Rules in a Job Shop Production System
This paper presents a simulation and comparison analysis conducted to investigate the due-date assignment methods through various scheduling rules. The due date assignment methods investigated are flow time due date (FTDD) and total work content (TWK) method. Three scheduling rules are integrated in the simulation for scheduling of jobs on machines. The performance of the study is evaluated bas...
متن کاملa comparison of linguistic and pragmatic knowledge: a case of iranian learners of english
در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...
15 صفحه اولComparison of selection rules for ordinal optimization
The evaluation of performance of a design for complex discrete event systems through simulation is usually very time consuming. Optimizing the system performance becomes even more computationally infeasible. Ordinal optimization (OO) is a technique introduced to attack this difficulty in system design by looking at “order” in performances among designs instead of “value” and providing a probabi...
متن کاملDue-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due date t+Dk. Equivalently, its delay k must not exceed a given delay or lead-time Dk. In a stochastic system, the constraint k Dk must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: A I I E Transactions
سال: 1981
ISSN: 0569-5554
DOI: 10.1080/05695558108974544